FUZZY CONNECTIONS AND COMPLETENESS IN COMPLETE RESIDUATED LATTICES
نویسندگان
چکیده
منابع مشابه
Fuzzy Connections and Relations in Complete Residuated Lattices
In this paper, we investigate the properties of fuzzy Galois (dual Galois, residuated, and dual residuated) connections in a complete residuated lattice L. We give their examples. In particular, we study fuzzy Galois (dual Galois, residuated, dual residuated) connections induced by L-fuzzy relations.
متن کاملFuzzy Integrals over Complete Residuated Lattices
The aim of this paper is to introduce two new types of fuzzy integrals, namely, ⊗-fuzzy integral and →-fuzzy integral, where ⊗ and → are the multiplication and residuum of a complete residuated lattice, respectively. The first integral is based on a fuzzy measure of L-fuzzy sets and the second one on a complementary fuzzy measure of L-fuzzy sets, where L is a complete residuated lattice. Some o...
متن کاملFuzzy attribute logic over complete residuated lattices
We present a logic, called fuzzy attribute logic, for reasoning about formulas describing particular attribute dependencies. The formulas are of a form A ⇒ B where A and B are collections of attributes. Our formulas can be interpreted in two ways. First, in data tables with entries containing degrees to which objects (table rows) have attributes (table columns). Second, in database tables where...
متن کاملOn Convergence of Fuzzy Integrals over Complete Residuated Lattices
Recently we proposed a new type of fuzzy integrals defined over complete residuated lattices. These integrals are intended for the modeling of type ⟨1, 1⟩ fuzzy quantifiers. An interesting theoretical question is, how to introduce various notions of convergence of this type of fuzzy integrals. In this contribution, we would like to present some results on strong and pointwise convergence of the...
متن کاملAxiomatization of Fuzzy Attribute Logic over Complete Residuated Lattices
The paper deals with fuzzy attribute logic (FAL) and shows its completeness over all complete residuated lattices. FAL is a calculus for reasoning with if-then rules describing particular attribute dependencies in objectattribute data. Completeness is proved in two versions: classical-style completeness and graded-style completeness.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Korean Journal of Mathematics
سال: 2013
ISSN: 1976-8605
DOI: 10.11568/kjm.2013.21.2.101